package com.acwing.partition35;

import java.io.*;
import java.util.Arrays;

/**
 * @author rkc
 * @date 2022/7/17 10:14
 */
public class AC3477简单排序 {

    private static final int N = 1010;
    private static int[] w = new int[N];
    private static int n;

    private static StreamTokenizer tokenizer = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
    private static PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));

    public static void main(String[] args) throws IOException {
        n = nextInt();
        for (int i = 0; i < n; i++) w[i] = nextInt();
        Arrays.sort(w, 0, n);
        writer.write(w[0] + " ");
        for (int i = 1, j = 1; i < n; i++) {
            if (w[i] != w[i - 1]) {
                writer.write(w[i] + " ");
            }
        }
        writer.flush();
    }

    private static int nextInt() throws IOException {
        tokenizer.nextToken();
        return (int) tokenizer.nval;
    }
}
